Linear constrained reduced rank and polynomial order methods
نویسندگان
چکیده
The Subspace-based Reduced Rank and Polynomial Order (RRPO) methods were proposed recently [1, 2, 3], which estimate a reduced order linear prediction polynomial whose roots are the desired "signal roots". In this paper, we describe how to extend the RRPO methods to include constraints involving known signal information. Simulation results indicate that by incorporating known signal information such as source direction angle, the estimation of unknown source directions can be signi cantly improved, especially when the unknown source is weak, closely spaced and highly coherent with the known source.
منابع مشابه
A Novel Frequency Domain Linearly Constrained Minimum Variance Filter for Speech Enhancement
A reliable speech enhancement method is important for speech applications as a pre-processing step to improve their overall performance. In this paper, we propose a novel frequency domain method for single channel speech enhancement. Conventional frequency domain methods usually neglect the correlation between neighboring time-frequency components of the signals. In the proposed method, we take...
متن کاملReduced Polynomial Order Linear Prediction - IEEE Signal Processing Letters
Reduced rank linear predictive frequency and direction-of-arrival (DOA) estimation algorithms use the singular value decomposition (SVD) to produce a noise-cleaned linear prediction vector. These algorithms then root this vector to obtain a subset of roots, whose angles contain the desired frequency or DOA information. The roots closest to the unit circle are deemed to be the "signal roots." Th...
متن کاملA Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
We present a Krylov subspace–type projection method for a quadratic matrix polynomial λ2I − λA − B that works directly with A and B without going through any linearization. We discuss a special case when one matrix is a low rank perturbation of the other matrix. We also apply the method to solve quadratically constrained linear least squares problem through a reformulation of Gander, Golub, and...
متن کاملBlind MIMO channel identification from second order statistics using rank deficient channel convolution matrix
For multiuser systems, several direct blind identification algorithms require that the linear multiple-input multiple-output (MIMO) system have a full rank convolution matrix. This condition requires that the system transfer function be irreducible and column reduced. We show that this restrictive identification condition can be relaxed for some direct blind identification methods to accommodat...
متن کاملLow - Rank Solution Methods for Large - Scale Linear Matrix Equations
LOW-RANK SOLUTION METHODS FOR LARGE-SCALE LINEAR MATRIX EQUATIONS Stephen D. Shank DOCTOR OF PHILOSOPHY Temple University, May, 2014 Professor Daniel B. Szyld, Chair We consider low-rank solution methods for certain classes of large-scale linear matrix equations. Our aim is to adapt existing low-rank solution methods based on standard, extended and rational Krylov subspaces to solve equations w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998